Task migration in n-dimensional wormhole-routed mesh multicomputers

In a mesh multicomputer performing jobs needs to schedule submeshes according to some processor allocation scheme In order to assign the incoming jobs to a free submesh a task compaction scheme is needed to generate a larger contiguous free region The overhead of com paction depends on the e ciency of the task migration scheme In this paper two simple task migration schemes are rst proposed in n dimensional mesh multicomputers with supporting dimension ordered wormhole routing in one port communication model Then a hybrid scheme which combines advantages of the two schemes is discussed Finally we evaluate the perfor mance of all of these proposed approaches